Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization
نویسندگان
چکیده
In this paper, we present several methods for construction of elliptic curves with large torsion group and positive rank over number fields of small degree. We also discuss potential applications of such curves in the elliptic curve factorization method (ECM).
منابع مشابه
Ranks of Elliptic Curves with Prescribed Torsion over Number Fields
We study the structure of the Mordell–Weil group of elliptic curves over number fields of degree 2, 3, and 4. We show that if T is a group, then either the class of all elliptic curves over quadratic fields with torsion subgroup T is empty, or it contains curves of rank 0 as well as curves of positive rank. We prove a similar but slightly weaker result for cubic and quartic fields. On the other...
متن کاملNew Families of ECM Curves for Cunningham Numbers
In this paper we study structures related to torsion of elliptic curves defined over number fields. The aim is to build families of elliptic curves more efficient to help factoring numbers of special form, including numbers from the Cunningham Project. We exhibit a family of curves with rational Z/4Z×Z/4Z torsion and positive rank over the field Q(ζ8) and a family of elliptic curves with ration...
متن کاملJKL-ECM: an implementation of ECM using Hessian curves
We present JKL-ECM, an implementation of the elliptic curve method of integer factorization which uses certain twisted Hessian curves in a family studied by Jeon, Kim and Lee. This implementation takes advantage of torsion subgroup injection for families of elliptic curves over a quartic number field, in addition to the ‘small parameter’ speedup. We produced thousands of curves with torsion Z/6...
متن کاملFinding Suitable Curves for the Elliptic Curve Method of Factorization
Using the parametrizations of Kubert, we show how to produce in nite families of elliptic curves which have prescribed nontrivial torsion over Q and rank at least one. These curves can be used to speed up the ECM factorization algorithm of Lenstra. We also brie y discuss curves with complex multiplication in this context.
متن کاملECM using Edwards curves
This paper introduces EECM-MPFQ, a fast implementation of the elliptic-curve method of factoring integers. EECM-MPFQ uses fewer modular multiplications than the well-known GMP-ECM software, takes less time than GMP-ECM, and finds more primes than GMP-ECM. The main improvements above the modular-arithmetic level are as follows: (1) use Edwards curves instead of Montgomery curves; (2) use extende...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Periodica Mathematica Hungarica
دوره 65 شماره
صفحات -
تاریخ انتشار 2012